The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF).

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

div(0, y) → 0
div(x, y) → quot(x, y, y)
quot(0, s(y), z) → 0
quot(s(x), s(y), z) → quot(x, y, z)
quot(x, 0, s(z)) → s(div(x, s(z)))

Rewrite Strategy: FULL

(1) DecreasingLoopProof (EQUIVALENT transformation)

The following loop(s) give(s) rise to the lower bound Ω(n¹):
The rewrite sequence
div(s(x16_1), s(0)) →⁺ s(div(x16_1, s(0)))
gives rise to a decreasing loop by considering the right hand sides subterm at position [0].
The pumping substitution is [x16_1 / s(x16_1)].
The result substitution is [ ].

(2) BOUNDS(n^1, INF)